منابع مشابه
Blocked and Recursive Algorithms for Triangular Tridiagonalization
We present partitioned (blocked) algorithms for reducing a symmetric matrix to a tridiagonal form, with partial pivoting. That is, the algorithms compute a factorization PAP = LTL where P is a permutation matrix, L is lower triangular with a unit diagonal, and T is symmetric and tridiagonal. The algorithms are based on the column-by-column methods of Parlett and Reid and of Aasen. Our implement...
متن کاملParallel Sparse Triangular Solution with Partitioned Inverses and Prescheduled Dags
Sparse triangular solution ooers a challenging irregular problem for parallel systems. The repeated solution of the system Lx = b, where L is a lower triangular factor of a sparse matrix, arises in numerous applications. A previous study 1] has shown that, if L is an incomplete factor, Lx = b can be eeciently solved on a parallel system through substitution. This was accomplished by representin...
متن کاملParallel Bandreduction and Tridiagonalization
This paper presents a parallel implementation of a blocked band reduction algorithm for symmetric matrices suggested by Bischof and Sun. The reduction to tridiagonal or block tridiagonal form is a special case of this algorithm. A blocked double torus wrap mapping is used as the underlying data distribution and the so-called WY representation is employed to represent block orthogonal transforma...
متن کاملTridiagonalization of Completely Nonnegative Matrices
Let M = [ttUiSi /_i be completely nonnegative (CNN), i.e., every minor of Mis nonnegative. Two methods for reducing the eigenvalue problem for M to that of a CNN, tridiagonal matrix, T = [?,-,] (r,-,= 0 when |i — j\ > 1), are presented in this paper. In the particular case that M is nonsingular it is shown for one of the methods that there exists a CNN nonsingular 5 such that SM = TS.
متن کاملParallel Tridiagonalization through Two-Step Band Reduction
We present a two-step variant of the \successive band reduction" paradigm for the tridiagonalization of symmetric matrices. Here we reduce a full matrix rst to narrow-banded form and then to tridiagonal form. The rst step allows easy exploitation of block orthogonal transformations. In the second step, we employ a new blocked version of a banded matrix tridiagonal-ization algorithm by Lang. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Mathematical Software
سال: 2011
ISSN: 0098-3500,1557-7295
DOI: 10.1145/1916461.1916462